Process Interconnection Structures in Dynamically Changing Topologies
نویسندگان
چکیده
This paper presents a mechanism that organizes processes in the hierarchy and efficiently maintains it in the presence of addition/removal of nodes to the system, and in the presence of node failures. This mechanism can support total order of broadcasts and does not rely on any specific system features or special hardware. In addition, it can concurrently support multiple logical structures, such as a ring, a hypercube, a mesh, and a tree.
منابع مشابه
Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
This paper studies the consensus problem of multi-agent systems with nonuniform time-delays and dynamically changing topologies. A linear consensus protocol is introduced to realize local control strategies for these second-order discrete-time agents. By model transformations and applying the properties of nonnegative matrices, sufficient conditions are derived for state consensus of the system...
متن کاملAverage Consensus in the Presence of Dynamically Changing Directed Graph Topologies and Time Delays
We have recently proposed a robustified ratio consensus algorithm which achieves asymptotic convergence to the global average in a distributed fashion in static strongly connected digraphs, despite the possible presence of bounded but otherwise arbitrary delays. In this work, we propose a protocol which reaches asymptotic convergence to the global average in a distributed fashion under possible...
متن کاملRobustness of Evolved Small-World Automata Networks
We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve. Moreover they show ...
متن کاملAverage Consensus in the Presence of Delays and Dynamically Changing Directed Graph Topologies
Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practical settings due to varying delays that might affect transmissions at different times, as well as possible changes in the ...
متن کاملEvolving Small-World Automata for the Majority Problem
We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve. Moreover they show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000